Solving the Maximum Independent Set Problem based on Molecule Parallel Supercomputing
نویسندگان
چکیده
منابع مشابه
Solving the Maximum Independent Set Problem based on Molecule Parallel Supercomputing
The maximum independent set Problem is to find a biggest vertex independent set in a given undirected graph. It is a vitally important NP problem in graph theory and applied mathematics, having numerous real life applications. It can be difficultly solved by the electronic computer in exponential level time. Simultaneity in previous studies DNA molecular computation usually be used to solve NP-...
متن کاملUsing Critical Sets for the Maximum Independent Set Problem Solving
The problem of finding a maximum independent set in an undirected graph is a well known NP-hard problem. On the other hand, the critical independent set problem is polynomially solvable. The relationship between these two problems is studied and a method that utilizes a nonempty critical independent set for solving the maximum independent set problem is developed. The efficiency of the proposed...
متن کاملA Natural Model and a Parallel Algorithm for Approximately Solving the Maximum Weighted Independent Set Problem
A dynamical model based upon a physical metaphor is described, and a parallel algorithm inspired from the model is developed for approximately solving maximum weight independent set problem. Our model treats an independent set as an attraction game, where vertices of the graph are considered as still bodies and edges as cells attracted by the still bodies corresponding to its extremities. In ad...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe maximum independent set problem on layered graphs
The independent set on a graph G = (V, E) is a subset of V such that no two vertices in the subset have an edge between them. The maximum independent set problem on G seeks to identify an independent set with maximum cardinality, i.e. maximum independent set or MIS. The maximum independent set problem on a general graph is known to be NP-complete. On certain classes of graphs MIS can be compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080531